Lower bounds for depth-restricted branching programs
نویسندگان
چکیده
منابع مشابه
Lower bounds for restricted read-once parity branching programs
We prove the first lower bounds for restricted read–once parity branching programs with unlimited parity nondeterminism where for each input the variables may be tested according to several orderings. Proving a superpolynomial lower bound for read–once parity branching programs is an important open problem. The following variant is well–motivated more general than variants for that lower bounds...
متن کاملOn lower bounds for parity branching programs
Acknowledgements I would like to acknowledge all the people whose support gave me the possibility to undergo the work of this thesis. First of all, I would like to express my thanks to my Advisor Prof. Dr. Stephan Waack for his extensive support. A large part of my knowledge of theoretical computer science is due to him. He introduced me to the fascinating field of branching programs and helped...
متن کاملA Lower Bound Technique for Restricted Branching Programs and Applications
We present a new lower bound technique for two types of restricted Branching Programs (BPs), namely for read-once BPs (BP1s) with restricted amount of nondeterminism and for (1,+k)-BPs. For this technique, we introduce the notion of (strictly) k-wise l-mixed Boolean functions, which generalizes the concept of l-mixedness defined by Jukna in 1988 [3]. We prove that if a Boolean function f ∈ Bn i...
متن کاملRamsey Theory and lower bounds for branching programs
A novel technique for obtaining lower bounds for the time versus space comp1exity of certain functions in a general input oblivious sequential model of computation is developed. This is demonstrated by studying the intrinsic complexity of the following set equality problem SE(n,m): Given a sequence x1 ,x2 ,· .• ,xn ' Yl'·· .'Yn of 2n numbers of m bits each, decide whether the sets (xl' ••• ,xnJ...
متن کاملCoding-Theoretic Lower Bounds for Boolean Branching Programs
We develop a general method for proving lower bounds on the complexity of branching programs. The proposed proof technique is based on a connection between branching programs and error-correcting codes and makes use of certain classical results in coding theory. Specifically, lower bounds on the complexity of branching programs computing certain important functions follow directly from lower bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1991
ISSN: 0890-5401
DOI: 10.1016/0890-5401(91)90072-a